Provability-based semantic interoperability via translation graphs

Abstract. Provability-based semantic interoperability (PBSI) is a kind of interoperability that transcends mere syntactic translation to allow for robust, meaningful information exchange across systems employing ontologies for which mappings or matchings may not exist, and which can be evaluated by provability-based (PB) queries. We introduce a system of translation graphs to formalize the relationships between diverse ontologies and knowledge representation and reasoning systems, and to automatically generate the translation axioms governing PB information exchange and inter-system reasoning. We demonstrate the use of translation graphs on a small number of simple systems to achieve interoperability. Key words: translation graphs, provability-based semantic interoperability 1 What is Semantic Interoperability? The proliferation of knowledge-rich systems has led to the creation of myriad intelligent systems possessing diverse reasoning capabilities. Unfortunately, cooperative efforts among these systems are hindered by lack of a common representatio

ICEWS Dictionaries

The ICEWS dictionaries contain both named individuals or groups, known as actors, and generic individuals or groups, known as agents. Actors are known by a specific name, such as 'Free Syrian Army' or 'Goodluck Johnathan', while agents are known by a generic improper noun, such as 'insurgents' or 'students'. Both actors and agents have time-dependent affiliations with another actor (in the case of an individual being a member of an organization, for example), a country or other autonomous region, or with a general sector/role, such as 'Military' or 'Government'. Also included in the dictionaries are aliases that an actor or agent might be known by. In the case of actors, these are typically alternate spellings of a person's name, while for agents they are typically synonyms. Additional information about the ICEWS program can be found at http://www.icews.com/. Follow our Twitter handle for data updates and other news: @icew

Harnessing Intelligent Agent Technology to “Superteach ” Reasoning

After briefly explaining our ultimate educational goal with respect to reasoning (to “superteach ” reasoning), and our theoretical foundation, we give an overview of some of our attempts to build and harness intelligent agents in order to reach this goal. We end with coverage of the Slate system, which inherits its power from lessons learned in connection with the engineering of its more primitive predecessors

Conf. on Artificial Intelligence | ICAI'07 | 43 The Multi-Mind Effect

Abstract Courtesy of experiments carried out by such thinkers as Wason, Johnson-Laird, and Kahneman & Tversky, there is overwhelming empirical evidence that the vast majority of logically untrained humans are unable to reason in context-independent, normatively correct fashion. However, the multi-mind effect, which is predicted by our earlier success at teaching this kind of reasoning, and also by our general theory of human and machine reasoning, shows that while individual persons (with rare exceptions) are unable to solve problems that demand context-independent reasoning, groups of persons can often solve such problems

A new Gödelian argument for hypercomputing minds based on the busy beaver problem

9.9.05 1245am NY time Do human persons hypercompute? Or, as the doctrine of computationalism holds, are they information processors at or below the Turing Limit? If the former, given the essence of hypercomputation, persons must in some real way be capable of infinitary information processing. Using as a springboard Gödel’s little-known assertion that the human mind has a power “converging to infinity, ” and as an anchoring problem Rado’s (1963) Turing-uncomputable “busy beaver ” (or Σ) function, we present in this short paper a new argument that, in fact, human persons can hypercompute. The argument is intended to be formidable, not conclusive: it brings Gödel’s intuition to a greater level of precision, and places it within a sensible case against computationalism.

Perfusion of Renal Allografts with Verapamil Improves Graft Function

The effect of adding a calcium channel antagonist to kidney allograft perfusate solution was assessed. All renal transplants in which both kidneys from the same donor used for transplantation were studied between November, 2003 and August, 2005 (n=46). The first renal allograft was perfused on the backtable with 1 L of histidine-tryptophan-ketoglurate solution and the second with 1 L of histidine-tryptophan-ketoglurate with 5 mg/L of verapamil. Both organs were transplanted in the usual manner. Baseline demographic parameters were similar between first and second kidney recipients other than BMI and cold ischemic time. At 6 and 12 months, renal function was significantly improved in the verapamil versus control cohort (creatinine clearance 73.8+/-23.5 mL/min vs. 55.8+/-17.0 mL/min, P\u3c0.05 and 87.5+/-28.4 mL/min vs. 59.7+/-21.3 mL/min, P\u3c0.05 respectively). Additionally, rates of hypotension during graft reperfusion and other adverse reactions were similar in both groups. In conclusion, verapamil supplemented perfusate significantly improved renal function posttransplantation